Constrained Optimization by Radial Basis Function Interpolation for High-Dimensional Expensive Black-Box Problems with Infeasible Initial Points
نویسنده
چکیده
منابع مشابه
A new trust-region algorithm based on radial basis function interpolation
Optimization using radial basis functions as an interpolation tool in trust-region (ORBIT), is a derivative-free framework based on fully linear models to solve unconstrained local optimization, especially when the function evaluations are computationally expensive. This algorithm stores the interpolation points and function values to using at subsequent iterations. Despite the comparatively ad...
متن کاملCONORBIT: constrained optimization by radial basis function interpolation in trust regions
This paper presents CONORBIT, a derivative-free algorithm for constrained black-box optimization where the objective and constraint functions are computationally expensive. CONORBIT employs a trust-region framework that uses interpolating radial basis function (RBF) models for the objective and constraint functions and is an extension of the ORBIT algorithm (Wild, Regis, and Shoemaker 2008). It...
متن کاملParallel radial basis function methods for the global optimization of expensive functions
We introduce a master–worker framework for parallel global optimization of computationally expensive functions using response surface models. In particular, we parallelize two radial basis function (RBF) methods for global optimization, namely, the RBF method by Gutmann [Gutmann, H.M., 2001a. A radial basis function method for global optimization. Journal of Global Optimization 19(3), 201–227] ...
متن کاملEfficient Surrogate Assisted Optimization for Constrained Black-Box Problems
Modern real-world optimization problems are often high dimensional and subject to many constraints. These problems are typically expensive in terms of cost and computational time. In order to optimize such problems, conventional constraintbased solvers require a high number of function evaluations which are not affordable in practice. Employment of fast surrogate models to approximate objective...
متن کاملSO-MI: A surrogate model algorithm for computationally expensive nonlinear mixed-integer black-box global optimization problems
This paper introduces a surrogate model based algorithm for computationally expensive mixed-integer black-box global optimization problems that may have computationally expensive constraints. The goal is to find accurate solutions with relatively few function evaluations. A radial basis function surrogate model (response surface) is used to select candidates for integer and continuous decision ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016